Access-Time-Aware Cache Algorithms
نویسندگان
چکیده
منابع مشابه
Cache-aware and Cache-oblivious Algorithms
---------------------------------------------------------------------------------------------iii Table of
متن کاملCache-Aware Real-Time Disk Scheduling
1Department of Computer Science, National Chung Hsing University, Taichung, Taiwan, R.O.C. 2Department of Information Management, National Central University, Jhongli City, Taoyuan, Taiwan, R.O.C. 3Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, R.O.C. 4Department of Computer & Information Science, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. Email: hp...
متن کاملCache-oblivious Algorithms Cache-oblivious Algorithms Acknowledgments
This thesis presents “cache-oblivious” algorithms that use asymptotically optimal amounts of work, and move data asymptotically optimally among multiple levels of cache. An algorithm is cache oblivious if no program variables dependent on hardware configuration parameters, such as cache size and cache-line length need to be tuned to minimize the number of cache misses. We show that the ordinary...
متن کامل10 . An Overview of Cache Optimization Techniques and Cache - Aware Numerical Algorithms
In order to mitigate the impact of the growing gap between CPU speed and main memory performance, today’s computer architectures implement hierarchical memory structures. The idea behind this approach is to hide both the low main memory bandwidth and the latency of main memory accesses which is slow in contrast to the floating-point performance of the CPUs. Usually, there is a small and expensi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Modeling and Performance Evaluation of Computing Systems
سال: 2017
ISSN: 2376-3639,2376-3647
DOI: 10.1145/3149001